Multi-mode resource-constrained project scheduling using modified variable neighborhood search heuristic
نویسندگان
چکیده
منابع مشابه
The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملIterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem
The resource constrained multi-mode multi-project scheduling problem (RCMMMPSP) is a notoriously difficult combinatorial optimization problem. For a given set of activities, feasible execution mode assignments and execution starting times must be found such that some optimization function, e. g. the makespan, is optimized. When determining an optimal (or at least feasible) assignment of decisio...
متن کاملthe combinatorial multi-mode resource constrained multi-project scheduling problem
this paper presents the formulation and solution of the combinatorial multi-mode resource constrained multi-project scheduling problem. the focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. the motivation for developing such an approach is due in part to practica...
متن کاملLocal search for nonpreemptive multi-mode resource-constrained project scheduling
This paper addresses a general class of nonpreemptive resource-constrained project scheduling problems in which activity durations are discrete functions of committed renewable and nonrenewable resources. We provide a well known 0±1 problem formulation and stress the importance of themodel by giving applications within production and operationsmanagement. Furthermore, we prove that the feasibil...
متن کاملTwo Heuristic Algorithms for a Multi-Mode Resource-Constrained Multi-Project Scheduling Problem
Many studies on the resource-constrained project-scheduling problem have been published, but literature further considering multi-mode or multi-project issues often occurring in the real world is rather scarce. In this research, two heuristic algorithms are developed to solve a multi-mode resource-constrained multi-project scheduling problem (MMRCMPSP). The first, a parallel scheduling algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2019
ISSN: 0969-6016
DOI: 10.1111/itor.12644